Search tree

Results: 965



#Item
51Online and Offline Learning in Multi-Objective Monte Carlo Tree Search Diego Perez, Spyridon Samothrakis and Simon Lucas School of Computer Science and Electronic Engineering University of Essex, Colchester CO4 3SQ, UK d

Online and Offline Learning in Multi-Objective Monte Carlo Tree Search Diego Perez, Spyridon Samothrakis and Simon Lucas School of Computer Science and Electronic Engineering University of Essex, Colchester CO4 3SQ, UK d

Add to Reading List

Source URL: eldar.mathstat.uoguelph.ca

Language: English - Date: 2016-07-12 12:05:04
52FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION Marius Muja, David G. Lowe Computer Science Department, University of British Columbia, Vancouver, B.C., Canada ,

FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION Marius Muja, David G. Lowe Computer Science Department, University of British Columbia, Vancouver, B.C., Canada ,

Add to Reading List

Source URL: www.geog.ucsb.edu

Language: English - Date: 2013-05-14 18:54:15
53On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh†  Bernard Lidick´

On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh† Bernard Lidick´

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:44:58
54Fixed-parameter algorithms for protein similarity search under mRNA structure constraints Guillaume Blin1 , Guillaume Fertin1 , Danny Hermelin2 , and St´ephane Vialette3 1

Fixed-parameter algorithms for protein similarity search under mRNA structure constraints Guillaume Blin1 , Guillaume Fertin1 , Danny Hermelin2 , and St´ephane Vialette3 1

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:57:23
55Can Quantum Search Accelerate Evolutionary Algorithms? Daniel Johannsen Max Planck Institute for Informatics Department of Algorithms and Complexity Saarbrücken, Germany

Can Quantum Search Accelerate Evolutionary Algorithms? Daniel Johannsen Max Planck Institute for Informatics Department of Algorithms and Complexity Saarbrücken, Germany

Add to Reading List

Source URL: www.cse.iitk.ac.in

Language: English - Date: 2016-07-30 09:35:21
56Faster Cover Trees Mike Izbicki Christian Shelton University of California Riverside, 900 University Ave, Riverside, CAAbstract

Faster Cover Trees Mike Izbicki Christian Shelton University of California Riverside, 900 University Ave, Riverside, CAAbstract

Add to Reading List

Source URL: rlair.cs.ucr.edu

Language: English - Date: 2015-05-27 17:50:32
57Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Add to Reading List

Source URL: emarkou.users.uth.gr

Language: English - Date: 2016-05-24 11:28:43
58Two Ellipse-based Pruning Methods for Group Nearest Neighbor Queries Hongga Li School of Computing National University of Singapore, Singapore

Two Ellipse-based Pruning Methods for Group Nearest Neighbor Queries Hongga Li School of Computing National University of Singapore, Singapore

Add to Reading List

Source URL: people.cs.aau.dk

Language: English - Date: 2007-06-07 03:45:31
59Identifying the Most Endangered Objects from Spatial Datasets Hua Lu Man Lung Yiu

Identifying the Most Endangered Objects from Spatial Datasets Hua Lu Man Lung Yiu

Add to Reading List

Source URL: people.cs.aau.dk

Language: English - Date: 2009-04-14 04:13:10
60Range Thresholding on Streams Miao Qiao Junhao Gan  Yufei Tao

Range Thresholding on Streams Miao Qiao Junhao Gan Yufei Tao

Add to Reading List

Source URL: staff.itee.uq.edu.au

Language: English - Date: 2016-04-16 04:52:33